Large Scale Circuit Partitioning With Loose / Stable Net RemovalAnd
نویسندگان
چکیده
In this paper, we present an eecient Iterative Improvement based Partitioning (IIP) algorithm called LSR/MFFS, that combines signal ow based Maximum Fanout Free Sub-graph (MFFS) clustering algorithm with Loose and Stable net Removal (LSR) partitioning algorithm. The MFFS algorithm generalizes existing MFFC decomposition method from combinational circuits to general sequential circuits in order to handle cycles naturally. We also study the properties of the nets that straddle the cutline carefully, and introduce the concepts of the loose and stable nets as well as eeective ways to remove them out of the cutset. The LSR/MFFS algorithm rst applies LSR algorithm to clustered netlist generated by MFFS algorithm for global-level cutsize optimization and then declusters netlist for further cutsize reenement. As a result, the LSR/MFFS algorithm has achieved the best cutsize result among all the bipartitioning algorithms published in the literatures with very promising runtime performance. In particular, it outperforms the recent state-of
منابع مشابه
Large Scale Circuit Partitioning with Loose/Stable Net Removal and Signal Flow Based Hierarchical Clustering
20 demonstrate the superiority of our approach over the best available iterative partitioning algorithm CLIP-PROP f DuDe96] with an average improvement of 7.1% in terms of minimum cutsize. In this paper, we introduced the notion and importance of loose net and provided a loose net removal (LR) algorithm to remove loose nets from the cutset. The stable net removal algorithm ShNK95] was then inco...
متن کاملCircuit Minimization in Vlsi Using Pso & Ga Algorithms
: Circuit partitioning is the more critical step in the physical design of various circuit in VLSI. In this partitioning main objective is to minimize the number of cuts. For this PSO algorithm is proposed for the optimization of VLSI inter connection (net list) bipartition. Meanwhile, the corresponding evaluation function and the operators of crossover and mutation are designed. The algorithm ...
متن کاملMulti Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملAn Interconnectivity based Efficient Partitioning Algorithm of Combinational CMOS Circuits
In this new technology era, circuit partitioning is a fundamental problem in very large-scale integration (VLSI) physical design automation. In this brief, we present a new interconnection oriented clustering algorithm for combinational VLSI circuit partitioning. The proposed clustering method focuses on capturing clusters in a circuit, i. e. , the groups of cells that are highly interconnected...
متن کاملInput Original Circuit Net Connections Required Clusters Postprocessing Preprocessing
As the complexity of VLSI circuits increases, a hierarchical design approach becomes essential to shorten the design period 1]. Circuit clustering plays a fundamental role in hierarchical designs. Identifying strongly connected components in the netlist can signiicantly reduce the complexity of the circuit and improve the performance of the design process. A good clustering method should identi...
متن کامل